Preemptive scheduling on two identical parallel machines with a single transporter
نویسندگان
چکیده
منابع مشابه
Preemptive scheduling on two identical parallel machines with a single transporter
We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal schedule and design an algorithm that ei...
متن کاملPreemptive scheduling on two parallel machines with a single server
This paper addresses a preemptive scheduling problem on two parallel machines with a single server. Each job has to be loaded (setup) by the server before being processed on the machines. The preemption is allowed in this paper. The goal is to minimize the makespan. We first show that it is no of use to preempt the job during its setup time. Namely, every optimal preemptive schedule can be conv...
متن کاملScheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines
This paper deals with the problem of processing a set of n jobs on two identical parallel machines. In order to reduce the probability of machine breakdown with minor sacrifices in production time, the machines cannot process the jobs consecutively, they need to be maintained regularly (here we assume that the largest consecutive working time for each machine cannot exceed an upper limit T). Tw...
متن کاملInteger preemptive scheduling on parallel machines
We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function has the following integer preemption property : for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting an...
متن کاملOnline Preemptive Scheduling on Parallel Machines
We consider an online version of the classical problem of preemptive scheduling on uniformly related machines. We are given m machines with speeds s 1 ≥ s 2 ≥. .. ≥ s m and a sequence of jobs, each described by its processing time (length). The actual time needed to process a job with length p on a machine with speed s is p/s. In the preemptive version, each job may be divided into several piec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2012
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-012-9511-x